The convergence of subspace trust region methods
نویسندگان
چکیده
منابع مشابه
Convergence analysis of Riemannian trust-region methods
This document is an expanded version of [ABG05], with a detailed convergence analysis. A general scheme for trust-region methods on Riemannian manifolds is proposed and analyzed. Among the various approaches available to (approximately) solve the trust-region subproblems, particular attention is paid to the truncated conjugate-gradient technique. The method is illustrated on problems from numer...
متن کاملSubspace Trust-Region Methods for Large Bound-Constrained Nonlinear Equations
Trust-region methods for solving large bound-constrained nonlinear systems are considered. These allow for spherical or elliptical trust-regions where the search for an approximate solution is restricted to a low dimensional space. A general formulation for these methods is introduced and global and superlinear/quadratic convergence is shown under standard assumptions. Viable approaches for imp...
متن کاملConvergence of Trust-Region Methods Based on Probabilistic Models
In this paper we consider the use of probabilistic or randommodels within a classical trustregion framework for optimization of deterministic smooth general nonlinear functions. Our method and setting differs from many stochastic optimization approaches in two principal ways. Firstly, we assume that the value of the function itself can be computed without noise, in other words, that the functio...
متن کاملConvergence of trust region augmented Lagrangian methods using variable
To date the primary focus of most constrained approximate optimization strategies is that application of the method should lead to improved designs. Few researchers have focused on the development of constrained approximate optimization strategies that are assured of converging to a Karush-Kuhn-Tucker (KKT) point for the problem. Recent work by the authors based on a trust region model manageme...
متن کاملMultiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration of a decomposition method, one step of a nonlinear programming scheme is applied to one piece of the MPEC to obtain the next iterate. Our goal is to understand global convergence to B-stationary points of these methods when the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2009.02.100